Approximating survivable networks with β-metric costs

نویسندگان

  • Johnny David
  • Zeev Nutov
چکیده

The Survivable Network Design (SND) problem seeks a minimum-cost subgraph that satisfies prescribed node-connectivity requirements. We consider SND on both directed and undirected complete graphs with -metric costs when c(xz) ≤ [c(xy) + c(yz)] for all x, y, z ∈ V , which varies from uniform costs ( = 1/2) to metric costs ( = 1). For the k-Connected Subgraph (k-CS) problem our ratios are: 1 + 2 k(1− ) − 1 2k−1 for undirected graphs, and 1 + 4 3 k(1−3 ) − 1 2k−1 for directed graphs and 12 ≤ < 1 3 . For undirected graphs this improves the ratios 1− of [2] and 2+ k n of [9] for all k ≥ 4 and 1 2 + 1 2k ≤ ≤ k 2 (k+1)−2 . We also show that SND admits the approximation ratios 2 1− for undirected graphs, and 4 3 1−3 2 for directed graphs and 1/2 ≤ ≤ 1/ √ 3. For two important particular cases of SND, so called Rooted SND and Subset k-CS, our ratios are 2 3 1−3 2 for directed graphs and 1− for Subset k-CS on undirected graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating Survivable Networks with Minimum Number of Steiner Points

Given a graph H = (U,E) and connectivity requirements r = {r(u, v) : u, v ∈ R ⊆ U}, we say that H satisfies r if it contains r(u, v) pairwise internally-disjoint uv-paths for all u, v ∈ R. We consider the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set V of points in a normed space (M, ‖·‖) and connectivity requirements, find a minimum size set S ⊂ ...

متن کامل

Survivable Probability of SDN-enabled Cloud Networking with Random Physical Link Failure

Software-driven cloud networking is a new paradigm in orchestrating physical resources (CPU, network bandwidth, energy, storage) allocated to network functions, services, and applications, which is commonly modeled as a crosslayer network. This model carries a physical network representing the physical infrastructure, a logical network showing demands, and logical-to-physical node/link mappings...

متن کامل

Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called spare capacity allocation (SCA). This paper presents a m...

متن کامل

Survivable Probability of Network Slicing with Random Physical Link Failure

The fifth generation of communication technology (5G) revolutionizes mobile networks and the associated ecosystems through the integration of cross-domain networks. Network slicing is an enabling technology for 5G as it provides dynamic, on-demand, and reliable logical network slices (i.e., network services) over a common physical network/infrastructure. Since a network slice is subject to fail...

متن کامل

Effects of Optical Layer Protection Granularity in Survivable Hierarchical Optical Path Network

This study compares the performances of waveband protection and wavelength path protection in survivable hierarchical optical path networks. Network costs and the number of switching operations necessary are evaluated for different ratios of protected demand. Numerical results demonstrate that waveband protection can drastically decrease the number of switching operations in the case of failure...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Discrete Algorithms

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2011